Volumes of codimension one manifolds and a randomized polynomial-time algorithm for computing the surface volume of a smooth convex body
نویسندگان
چکیده
In this thesis we develop estimates for volumes of smooth boundary manifolds by deriving explicit relations between a heat flow across the surface and its volume. Applying these estimates together with existing results on randomised volume computation and rates of rapidly mixing chains on convex sets, we are able to derive a randomised algorithm for computing the surface volume of a smooth convex body M , that runs in time that is polynomial in the dimension d, a smoothness parameter (the “condition number”) 1/τ and inverse error 1/2. We also include a brief survey of known results related to computing the volume and surface area of a convex body. Chapter 1 The heat flow across codimension one manifolds and their volume
منابع مشابه
Sweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملOn the Complexity of Computing Mixed Volumes
This paper gives various (positive and negative) results on the complexity of the problem of computing and approximating mixed volumes of polytopes and more general convex bodies in arbitrary dimension. On the negative side, we present several #P-hardness results that focus on the difference of computing mixed volumes versus computing the volume of polytopes. We show that computing the volume o...
متن کاملParallelizing Assignment Problem with DNA Strands
Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...
متن کاملComputing Mixed Discriminants , Mixed Volumes
We construct a probabilistic polynomial time algorithm that computes the mixed discriminant of given n positive definite n × n matrices within a 2O(n) factor. As a corollary, we show that the permanent of an n×n nonnegative matrix and the mixed volume of n ellipsoids inRn can be computed within a 2O(n) factor by probabilistic polynomial time algorithms. Since every convex body can be approximat...
متن کاملSIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD
In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006